Data Compression Algorithms for Wireless Sensor Networks: A Review and Comparison

Energy consumption has risen to be a bottleneck in wireless sensor networks. This is caused by the challenges faced these networks due their tiny nodes that have limited memory storage, small battery capacity, processing capability, and bandwidth. Data compression been used reduce energy improve network lifetime, as it reduces data size before can forwarded from sensing node sink network. In this paper, survey comparison of currently available techniques are conducted. Suitable sets criteria defined classify existing algorithms. An adaptive lossless algorithm (ALDC) analyzed through MATLAB coding simulation reviewed techniques. The analysis aims discover strategies amount further transmitted. From analysis, was discovered encoding residue samples, rather than raw reduced bitstream 112 bits range 30 36 depending on sample block sizes. average length samples passed encoder minimized original 14 per symbol 1.125 symbol. demonstrated 0.875 code efficiency or redundancy. It resulted an saving 67.8% 73.2%. work proposes encodes with fewer ALDC algorithm. 26 bits. equal entropy demonstrating zero redundancy improved 76.8% compared ALDC. proposed algorithm, therefore, shows compression.